翻訳と辞書 Words near each other ・ Regular conditional probability ・ Regular constraint ・ Regular Democratic Organization ・ Regular Division of the Plane ・ Regular dodecahedron ・ Regular economy ・ Regular element ・ Regular element of a Lie algebra ・ Regular embedding ・ Regular expression ・ Regular extension ・ Regular Force ・ Regular Fries ・ Regular grammar ・ Regular Grand Lodge of Macedonia ・ Regular graph ・ Regular grid ・ Regular Guys ・ Regular Hadamard matrix ・ Regular haircut ・ Regular homotopy ・ Regular icosahedron ・ Regular ideal ・ Regular insulin ・ Regular isotopy ・ Regular Joe ・ Regular Joe (TV series) ・ Regular John ・ Regular language ・ Regular Language description for XML Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Regular graph ： ウィキペディア英語版 Regular graph In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other.〔 〕 A regular graph with vertices of degree k is called a k‑regular graph or regular graph of degree k. Regular graphs of degree at most 2 are easy to classify: A 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of disconnected cycles and infinite chains. A 3-regular graph is known as a cubic graph. A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number ''l'' of neighbors in common, and every non-adjacent pair of vertices has the same number ''n'' of neighbors in common. The smallest graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices. The complete graph $K\_m$ is strongly regular for any $m$. A theorem by Nash-Williams says that every k‑regular graph on 2k + 1 vertices has a Hamiltonian cycle. Image:0-regular_graph.svg|0-regular graph Image:1-regular_graph.svg|1-regular graph Image:2-regular_graph.svg|2-regular graph Image:3-regular_graph.svg|3-regular graph == Existence == It is well known that the necessary and sufficient conditions for a $k$ regular graph of order $n$ to exist are that $n\; \backslash geq\; k+1$ and that $nk$ is even. In such case it is easy to construct regular graphs by considering appropriate parameters for circulant graphs. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Regular graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.